0.06/0.10 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.06/0.10 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 240 THM 0.09/0.31 % Computer : n010.cluster.edu 0.09/0.31 % Model : x86_64 x86_64 0.09/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.09/0.31 % Memory : 8042.1875MB 0.09/0.31 % OS : Linux 3.10.0-693.el7.x86_64 0.09/0.31 % CPULimit : 1920 0.09/0.31 % WCLimit : 240 0.09/0.31 % DateTime : Wed Jul 30 07:51:19 EDT 2025 0.09/0.31 % CPUTime : 0.16/0.44 Running higher-order theorem proving 0.16/0.48 Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=240 /export/starexec/sandbox2/tmp/tmp.lwZisK7poE/E---3.1_16574.p 0.30/0.54 # Version: 3.0.0-ho 0.30/0.54 # Preprocessing class: HSLMSMSSLLLCHSA. 0.30/0.54 # Scheduled 6 strats onto 8 cores with 240 seconds (1920 total) 0.30/0.54 # Starting lpo1_fix with 720s (3) cores 0.30/0.54 # Starting full_lambda_9 with 240s (1) cores 0.30/0.54 # Starting almost_fo_4 with 240s (1) cores 0.30/0.54 # Starting new_ho_9 with 240s (1) cores 0.30/0.54 # Starting pre_casc_4 with 240s (1) cores 0.30/0.54 # Starting ho_unfolding_6 with 240s (1) cores 0.30/0.54 # pre_casc_4 with pid 16659 completed with status 0 0.30/0.54 # Result found by pre_casc_4 0.30/0.54 # Preprocessing class: HSLMSMSSLLLCHSA. 0.30/0.54 # Scheduled 6 strats onto 8 cores with 240 seconds (1920 total) 0.30/0.54 # Starting lpo1_fix with 720s (3) cores 0.30/0.54 # Starting full_lambda_9 with 240s (1) cores 0.30/0.54 # Starting almost_fo_4 with 240s (1) cores 0.30/0.54 # Starting new_ho_9 with 240s (1) cores 0.30/0.54 # Starting pre_casc_4 with 240s (1) cores 0.30/0.54 # SinE strategy is GSinE(CountFormulas,,true,1.5,0,3,20000,1.0,true) 0.30/0.54 # Search class: HGUSM-FSLM31-DHSMMSBN 0.30/0.54 # partial match(2): HGHSM-FSLM31-MHSMMSBN 0.30/0.54 # Scheduled 6 strats onto 1 cores with 240 seconds (240 total) 0.30/0.54 # Starting new_ho_10_cnf2 with 126s (1) cores 0.30/0.54 # new_ho_10_cnf2 with pid 16661 completed with status 0 0.30/0.54 # Result found by new_ho_10_cnf2 0.30/0.54 # Preprocessing class: HSLMSMSSLLLCHSA. 0.30/0.54 # Scheduled 6 strats onto 8 cores with 240 seconds (1920 total) 0.30/0.54 # Starting lpo1_fix with 720s (3) cores 0.30/0.54 # Starting full_lambda_9 with 240s (1) cores 0.30/0.54 # Starting almost_fo_4 with 240s (1) cores 0.30/0.54 # Starting new_ho_9 with 240s (1) cores 0.30/0.54 # Starting pre_casc_4 with 240s (1) cores 0.30/0.54 # SinE strategy is GSinE(CountFormulas,,true,1.5,0,3,20000,1.0,true) 0.30/0.54 # Search class: HGUSM-FSLM31-DHSMMSBN 0.30/0.54 # partial match(2): HGHSM-FSLM31-MHSMMSBN 0.30/0.54 # Scheduled 6 strats onto 1 cores with 240 seconds (240 total) 0.30/0.54 # Starting new_ho_10_cnf2 with 126s (1) cores 0.30/0.54 # Preprocessing time : 0.004 s 0.30/0.54 # Presaturation interreduction done 0.30/0.54 0.30/0.54 # Proof found! 0.30/0.54 # SZS status Theorem 0.30/0.54 # SZS output start CNFRefutation 0.30/0.54 thf(decl_23, type, is_of: $i > ($i > $o) > $o). 0.30/0.54 thf(decl_24, type, all_of: ($i > $o) > ($i > $o) > $o). 0.30/0.54 thf(decl_26, type, in: $i > $i > $o). 0.30/0.54 thf(decl_78, type, e_is: $i > $i > $i > $o). 0.30/0.54 thf(decl_124, type, nat: $i). 0.30/0.54 thf(decl_125, type, n_is: $i > $i > $o). 0.30/0.54 thf(decl_131, type, n_1: $i). 0.30/0.54 thf(decl_163, type, n_ts: $i > $i > $i). 0.30/0.54 thf(decl_165, type, esk1_0: $i). 0.30/0.54 thf(def_all_of, axiom, ((all_of)=(^[X3:$i > $o, X2:$i > $o]:(![X4:$i]:(((is_of @ X4 @ X3)=>(X2 @ X4)))))), file('/export/starexec/sandbox2/tmp/tmp.lwZisK7poE/E---3.1_16574.p', def_all_of)). 0.30/0.54 thf(def_is_of, axiom, ((is_of)=(^[X1:$i, X2:$i > $o]:((X2 @ X1)))), file('/export/starexec/sandbox2/tmp/tmp.lwZisK7poE/E---3.1_16574.p', def_is_of)). 0.30/0.54 thf(def_e_is, axiom, ((e_is)=(^[X1:$i, X60:$i, X61:$i]:(((X60)=(X61))))), file('/export/starexec/sandbox2/tmp/tmp.lwZisK7poE/E---3.1_16574.p', def_e_is)). 0.30/0.54 thf(def_n_is, axiom, ((n_is)=(^[Z0/* 19 */:$i, Z1:$i]:(((Z0)=(Z1))))), file('/export/starexec/sandbox2/tmp/tmp.lwZisK7poE/E---3.1_16574.p', def_n_is)). 0.30/0.54 thf(satz28g, conjecture, (all_of @ (^[X1:$i]:((in @ X1 @ nat))) @ (^[X1:$i]:((n_is @ X1 @ (n_ts @ n_1 @ X1))))), file('/export/starexec/sandbox2/tmp/tmp.lwZisK7poE/E---3.1_16574.p', satz28g)). 0.30/0.54 thf(satz28c, axiom, (all_of @ (^[X1:$i]:((in @ X1 @ nat))) @ (^[X1:$i]:((n_is @ (n_ts @ n_1 @ X1) @ X1)))), file('/export/starexec/sandbox2/tmp/tmp.lwZisK7poE/E---3.1_16574.p', satz28c)). 0.30/0.54 thf(c_0_6, plain, ((all_of)=(^[Z0/* 19 */:$i > $o, Z1:$i > $o]:(![X4:$i]:((((Z0 @ X4))=>(Z1 @ X4)))))), inference(fof_simplification,[status(thm)],[def_all_of])). 0.30/0.54 thf(c_0_7, plain, ((is_of)=(^[Z0/* 19 */:$i, Z1:$i > $o]:((Z1 @ Z0)))), inference(fof_simplification,[status(thm)],[def_is_of])). 0.30/0.54 thf(c_0_8, plain, ((e_is)=(^[Z0/* 19 */:$i, Z1:$i, Z2:$i]:(((Z1)=(Z2))))), inference(fof_simplification,[status(thm)],[def_e_is])). 0.30/0.54 thf(c_0_9, plain, ((all_of)=(^[Z0/* 19 */:$i > $o, Z1:$i > $o]:(![X4:$i]:((((Z0 @ X4))=>(Z1 @ X4)))))), inference(apply_def,[status(thm)],[c_0_6, c_0_7])). 0.30/0.54 thf(c_0_10, axiom, ((n_is)=(^[Z0/* 19 */:$i, Z1:$i]:(((Z0)=(Z1))))), inference(apply_def,[status(thm)],[def_n_is, c_0_8])). 0.30/0.54 thf(c_0_11, negated_conjecture, ~(![X445:$i]:(((in @ X445 @ nat)=>((X445)=(n_ts @ n_1 @ X445))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[satz28g])]), c_0_9]), c_0_10])). 0.30/0.54 thf(c_0_12, plain, ![X471:$i]:(((in @ X471 @ nat)=>((n_ts @ n_1 @ X471)=(X471)))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[satz28c]), c_0_9]), c_0_10])). 0.30/0.54 thf(c_0_13, negated_conjecture, ((in @ esk1_0 @ nat)&((esk1_0)!=(n_ts @ n_1 @ esk1_0))), inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])])])). 0.30/0.54 thf(c_0_14, plain, ![X633:$i]:((~(in @ X633 @ nat)|((n_ts @ n_1 @ X633)=(X633)))), inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])])). 0.30/0.54 thf(c_0_15, negated_conjecture, ((esk1_0)!=(n_ts @ n_1 @ esk1_0)), inference(split_conjunct,[status(thm)],[c_0_13])). 0.30/0.54 thf(c_0_16, plain, ![X1:$i]:((((n_ts @ n_1 @ X1)=(X1))|~((in @ X1 @ nat)))), inference(split_conjunct,[status(thm)],[c_0_14])). 0.30/0.54 thf(c_0_17, negated_conjecture, (in @ esk1_0 @ nat), inference(split_conjunct,[status(thm)],[c_0_13])). 0.30/0.54 thf(c_0_18, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15, c_0_16]), c_0_17])]), ['proof']). 0.30/0.54 # SZS output end CNFRefutation 0.30/0.54 # Parsed axioms : 438 0.30/0.54 # Removed by relevancy pruning/SinE : 325 0.30/0.54 # Initial clauses : 154 0.30/0.54 # Removed in clause preprocessing : 9 0.30/0.54 # Initial clauses in saturation : 145 0.30/0.54 # Processed clauses : 161 0.30/0.54 # ...of these trivial : 4 0.30/0.54 # ...subsumed : 23 0.30/0.54 # ...remaining for further processing : 134 0.30/0.54 # Other redundant clauses eliminated : 7 0.30/0.54 # Clauses deleted for lack of memory : 0 0.30/0.54 # Backward-subsumed : 0 0.30/0.54 # Backward-rewritten : 0 0.30/0.54 # Generated clauses : 9 0.30/0.54 # ...of the previous two non-redundant : 8 0.30/0.54 # ...aggressively subsumed : 0 0.30/0.54 # Contextual simplify-reflections : 0 0.30/0.54 # Paramodulations : 2 0.30/0.54 # Factorizations : 0 0.30/0.54 # NegExts : 0 0.30/0.54 # Equation resolutions : 7 0.30/0.54 # Disequality decompositions : 0 0.30/0.54 # Total rewrite steps : 15 0.30/0.54 # ...of those cached : 5 0.30/0.54 # Propositional unsat checks : 0 0.30/0.54 # Propositional check models : 0 0.30/0.54 # Propositional check unsatisfiable : 0 0.30/0.54 # Propositional clauses : 0 0.30/0.54 # Propositional clauses after purity: 0 0.30/0.54 # Propositional unsat core size : 0 0.30/0.54 # Propositional preprocessing time : 0.000 0.30/0.54 # Propositional encoding time : 0.000 0.30/0.54 # Propositional solver time : 0.000 0.30/0.54 # Success case prop preproc time : 0.000 0.30/0.54 # Success case prop encoding time : 0.000 0.30/0.54 # Success case prop solver time : 0.000 0.30/0.54 # Current number of processed clauses : 9 0.30/0.54 # Positive orientable unit clauses : 4 0.30/0.54 # Positive unorientable unit clauses: 0 0.30/0.54 # Negative unit clauses : 3 0.30/0.54 # Non-unit-clauses : 2 0.30/0.54 # Current number of unprocessed clauses: 110 0.30/0.54 # ...number of literals in the above : 346 0.30/0.54 # Current number of archived formulas : 0 0.30/0.54 # Current number of archived clauses : 118 0.30/0.54 # Clause-clause subsumption calls (NU) : 2893 0.30/0.54 # Rec. Clause-clause subsumption calls : 597 0.30/0.54 # Non-unit clause-clause subsumptions : 23 0.30/0.54 # Unit Clause-clause subsumption calls : 9 0.30/0.54 # Rewrite failures with RHS unbound : 0 0.30/0.54 # BW rewrite match attempts : 1 0.30/0.54 # BW rewrite match successes : 0 0.30/0.54 # Condensation attempts : 161 0.30/0.54 # Condensation successes : 0 0.30/0.54 # Termbank termtop insertions : 34570 0.30/0.54 # Search garbage collected termcells : 11059 0.30/0.54 0.30/0.54 # ------------------------------------------------- 0.30/0.54 # User time : 0.037 s 0.30/0.54 # System time : 0.005 s 0.30/0.54 # Total time : 0.042 s 0.30/0.54 # Maximum resident set size: 4144 pages 0.30/0.54 0.30/0.54 # ------------------------------------------------- 0.30/0.54 # User time : 0.044 s 0.30/0.54 # System time : 0.008 s 0.30/0.54 # Total time : 0.051 s 0.30/0.54 # Maximum resident set size: 2468 pages 0.30/0.54 % E exiting 0.30/0.54 % E exiting 0.30/0.54 EOF